Verifying correctness of persistent concurrent data structures: a sound and complete method

Abstract Non-volatile memory (NVM), aka persistent memory, is a new paradigm that preserves its contents even after power loss. The expected ubiquity of NVM has stimulated interest in the design concurrent data structures, together with associated notions correctness. In this paper, we present formal proof technique for durable linearizability , which correctness criterion extends to handle crashes and recovery context ofNVM.Our proofs are based on refinement Input/Output automata (IOA) representations structures. To end, develop generic procedure transforming any standard sequential structure into specification prove transformation both sound complete. Since only exhibits durably linearizable behaviours, it serves as abstract our proof. We exemplify recently proposed persistentmemory queue builds Michael Scott’s lock-free queue. support proofs, describe an automated translation from code IOA thread-local verifying invariants.